Upgraded Maximum Urgency First Algorithm For Real Time Systems
نویسندگان
چکیده
In this paper Upgraded Maximum Urgency First (UMUF) scheduling algorithm has been proposed. This algorithm is a further improvement in MMUF algorithm [1] and is a mixed priority scheduling algorithm which combines the advantages of both fixed and dynamic scheduling for better CPU utilization and throughput. The prime objective of this paper is to improve modified maximum urgency first scheduling (MMUF) using LPB (Laxity per Burst time) as the dynamic priority. UMUF algorithm is mainly suited for real time systems where meeting of deadlines is an important criterion for scheduling. This proposed algorithm improves the Modified Maximum Urgency First scheduling algorithm for real time tasks proposed by V.Salmani et.al [1] and the experimental analysis shows that the proposed algorithm(UMUF algorithm) performs better than MMUF [1] and MUF[6] scheduling algorithm by minimizing average turnaround time, average waiting time and maximizing the throughput. General Terms:Earliest Deadline First scheduling(EDF), Upgraded Maximum Urgency First scheduling (UMUF), Least Laxity First scheduling(LLF), Modified Least Laxity First scheduling(MLLF), Maximum Urgency First scheduling (MUF), Modified Maximum Urgency First scheduling (MMUF), Scheduling
منابع مشابه
A Modified Maximum Urgency First Scheduling Algorithm for Real-Time Tasks
This paper presents a modified version of the maximum urgency first scheduling algorithm. The maximum urgency algorithm combines the advantages of fixed and dynamic scheduling to provide the dynamically changing systems with flexible scheduling. This algorithm, however, has a major shortcoming due to its scheduling mechanism which may cause a critical task to fail. The modified maximum urgency ...
متن کاملReal-Time Scheduling of Sensor-Based Control Systems
Many sensor-based control systems are dynamically changing, and thus require a flexible scheduler. The rate monotonic (RM) real-time scheduling algorithm does not support such dynamic systems very well. On the other hand, with earliest-deadline-first (EDF) and minimum-laxity-first (MLF) dynamic scheduling algorithms, a transient overload in the system may cause a critical task to fail, which is...
متن کاملMaximum Power Point Tracker for Photovoltaic Systems Based on Moth-Flame Optimization Considering Partial Shading Conditions
The performance of photovoltaic (PV) systems is highly dependent on environmental conditions. Due to probable changes in environmental conditions, the real-time control of PV systems is essential for exploiting their maximum possible power. This paper proposes a new method to track the maximum power point of PV systems using the moth-flame optimization algorithm. In this method, the PV DC-DC co...
متن کاملCapturing urgency and parallelism using quasi-deadlines for real-time multiprocessor scheduling
Recent trends toward multi-core architectures in real-time embedded systems pose challenges in designing efficient real-time multiprocessor scheduling algorithms. We believe that it is important to take into consideration both timing constraints of tasks (urgency) and parallelism restrictions of multiprocessor platforms (parallelism) together when designing scheduling algorithms. Motivated by t...
متن کامل